A linear time approximation scheme for job shopscheduling ?
نویسندگان
چکیده
In this paper we present a linear time approximation scheme for the non-preemptive job shop scheduling problem when the number of machines and the number of operations per job are xed. We also show how to extend the approximation scheme for the preemptive version of the problem. Let p max = max ij p ij denote the maximum processing time of any operation. Let max = max 1im P j;kjmkj=i p kj be the maximum load or total processing time assigned to any machine.
منابع مشابه
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
In this paper we present a linear time approximation scheme for the job shop scheduling problem with fixed number of machines and fixed number of operations per job. This improves on the previously best 2 + ǫ, ǫ > 0, approximation algorithm for the problem by Shmoys, Stein, and Wein. Our approximation scheme is very general and it can be extended to the case of job shop scheduling problems with...
متن کاملLinear Program for the Problem
In this lecture, we study the topic of Job Scheduling. The problem of job scheduling is that if we have n jobs and m machines and we have a processing time pij of each machine i for each job j, the task is to find a schedule to assign the jobs to the m machines to complete all the n jobs such that the completion time of all jobs will be minimized. If each job j has the same running time pj on e...
متن کاملApproximation Algorithms for Flexible Job Shop Problems
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The problem is to assign operations to machines and to order the operations on the machines so that the operations can be processed in the smallest amount of time. This models a wide variety of problems encountered in real ...
متن کاملA linear time approximation scheme for the single machine scheduling problem with controllable processing times
In a scheduling problem with controllable processing times the job processing time can be compressed through incurring an additional cost. We consider the problem of scheduling n jobs on a single machine with controllable processing times. Each job has a release date when it becomes available for processing, and, after completing its processing, requires an additional delivery time. Feasible sc...
متن کاملScheduling Parallel Jobs with Linear Speedup
We consider a scheduling problem where a set of jobs is apriori distributed over parallel machines. The processing time of any job is dependent on the usage of a scarce renewable resource, e.g. personnel. An amount of k units of that resource can be allocated to the jobs at any time, and the more of that resource is allocated to a job, the smaller its processing time. The dependence of processi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007